Signed and Minus Domination in Complete Multipartite Graphs
نویسنده
چکیده
In this paper we determine the exact values of the signed domination number, signed total domination number, and minus domination number of complete multipartite graphs, which substantially generalizes some previous results obtained for special subclasses of complete multipartite graphs such as cliques and complete bipartite graphs.
منابع مشابه
Characterization of signed paths and cycles admitting minus dominating function
If G = (V, E, σ) is a finite signed graph, a function f : V → {−1, 0, 1} is a minusdominating function (MDF) of G if f(u) +summation over all vertices v∈N(u) of σ(uv)f(v) ≥ 1 for all u ∈ V . In this paper we characterize signed paths and cycles admitting an MDF.
متن کاملTwin minus domination in directed graphs
Let $D=(V,A)$ be a finite simple directed graph. A function$f:Vlongrightarrow {-1,0,1}$ is called a twin minus dominatingfunction (TMDF) if $f(N^-[v])ge 1$ and $f(N^+[v])ge 1$ for eachvertex $vin V$. The twin minus domination number of $D$ is$gamma_{-}^*(D)=min{w(f)mid f mbox{ is a TMDF of } D}$. Inthis paper, we initiate the study of twin minus domination numbersin digraphs and present some lo...
متن کاملDomination and Signed Domination Number of Cayley Graphs
In this paper, we investigate domination number as well as signed domination numbers of Cay(G : S) for all cyclic group G of order n, where n in {p^m; pq} and S = { a^i : i in B(1; n)}. We also introduce some families of connected regular graphs gamma such that gamma_S(Gamma) in {2,3,4,5 }.
متن کاملA note on signed and minus domination in graphs
In this paper, we give upper bounds on the upper signed domination number of [l, k] graphs, which generalize some results obtained in other papers. Further, good lower bounds are established for the minus ksubdomination number γ−101 ks and signed k-subdomination number γ −11 ks .
متن کاملThe minus k-domination numbers in graphs
For any integer , a minus k-dominating function is afunction f : V (G) {-1,0, 1} satisfying w) for every vertex v, where N(v) ={u V(G) | uv E(G)} and N[v] =N(v)cup {v}. The minimum of the values of v), taken over all minusk-dominating functions f, is called the minus k-dominationnumber and is denoted by $gamma_k^-(G)$ . In this paper, we introduce the study of minu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ars Comb.
دوره 126 شماره
صفحات -
تاریخ انتشار 2016